Verification of quantum programs

Verification of Quantum Programs

This paper develops verification methodology for quantum programs, and the contribution of the paper is twofold: • Sharir, Pnueli and Hart [SIAM J. Comput. 13(1984)292-314] presented a general method for proving properties of probabilistic programs, in which a probabilistic program is modeled by a Markov chain and an assertion on the output distribution is extended into an invariant assertion o...

Runtime verification of programs using rule-based active system

A Logic for Formal Verification of Quantum Programs

This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quantum probabilistic programs. Our target programming language is QPL defined by Selinger, and our logic is an extension of the probabilistic Hoare-style logic defined by den Hartog. In this paper, we demonstrate how the quantum Ho...

Formal Verification of Programs

It is argued that formal verification ofThis paper introduced weakest preconditions.programs, no matter how obtained, will not play the same key role in the development of computer sci-Dijkstra76ence and software engineering as proofs do inDijkstra, E. W. A Discipline of Programming.mathematics. Furthermore the absence of continuity, the inevitability of change, and the ...

Verification of JCSP Programs

We describe the first proof system for concurrent programs based on Communicating Sequential Processes for Java (JCSP). The system extends a complete calculus for the JavaCard Dynamic Logic with support for JCSP, which is modeled in terms of the CSP process algebra. Together with a novel efficient calculus for CSP, a rule system is obtained that enables JCSP programs to be executed symbolically...